On directionally differentiable multiobjective programming problems with vanishing constraints

On constraint qualifications in directionally differentiable multiobjective optimization problems

We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints such that all functions are, at least, Dini differentiable (in some cases, Hadamard differentiable and sometimes, quasiconvex). Several constraint qualifications are given in such a way that generalize both the qualifications introduced by Maeda and the classical ones, when the f...

Characterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formula...

On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints

In this paper, we consider a nonsmooth multiobjective semi-infinite programming problem with vanishing constraints (MOSIPVC). We introduce stationary conditions for the MOSIPVCs and establish the strong Karush-Kuhn-Tucker type sufficient optimality conditions for the MOSIPVC under generalized convexity assumptions.

Inference on Directionally Differentiable Functions

This paper studies an asymptotic framework for conducting inference on parameters of the form φ(θ0), where φ is a known directionally differentiable function and θ0 is estimated by θ̂n. In these settings, the asymptotic distribution of the plug-in estimator φ(θ̂n) can be readily derived employing existing extensions to the Delta method. We show, however, that the “standard” bootstrap is only cons...

On some sufficient optimality conditions in multiobjective differentiable programming